Mode multigrid - A novel convergence acceleration method

Modified frame algorithm and its convergence acceleration by Chebyshev method

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

Convergence analysis of a multigrid method for convection-diffusion equations

Krylov Subspace Acceleration Method for Nonlinear Multigrid Schemes

In this paper we present a Krylov acceleration technique for nonlinear PDEs. As a `precon-ditioner' we use nonlinear multigrid schemes, like FAS 1]. The beneets of the combination of nonlinear multigrid and the new proposed accelerator is shown for diicult nonlinear ellip-tic scalar problems, like the Bratu problem and for systems of nonlinear equations, like the Navier-Stokes equations.

A Note on Multigrid Convergence

We generalise the abstract V-cycle convergence proof of 20] and 21] to include unsymmetricsmoothing operations as well. In the case of full regularity we obtain better convergence with an increasing number of smoothing steps, thus recovering the results of 2]. Applying our theory to an anisotropic model problem we obtain optimal results in this case as well.

An Algebraic Multigrid Method with Guaranteed Convergence Rate

We consider the iterative solution of large sparse symmetric positive definite linear systems. We present an algebraic multigrid method which has a guaranteed convergence rate for the class of nonsingular symmetric M-matrices with nonnegative row sum. The coarsening is based on the aggregation of the unknowns. A key ingredient is an algorithm that builds the aggregates while ensuring that the c...